Optimal parallel selection has complexity O(Log Log N)
نویسندگان
چکیده
منابع مشابه
An Optimal O(log log N)-Time Parallel Algorithm for Detecting All Squares in a String
An optimal O(loglogn) time concurrent-read concurrent-write parallel algorithm for detecting all squares in a string is presented. A tight lower bound shows that over general alphabets this is the fastest possible optimal algorithm. When p processors are available the bounds become 0(fnl;gnl +loglogrl+p/n12p).
متن کاملAn Optimal O(log log n) Time Parallel String Matching Algorithm
An optimalO(log log n) time parallel algorithm for string matching on CRCWPRAM is presented. It improves previous results of [G] and [V].
متن کاملConvex Hull with Optimal Query Time and O ( log n · log log n ) Update Time
The dynamic maintenance of the convex hull of a set of points in the plane is one of the most important problems in computational geometry. We present a data structure supporting point insertions in amortized O(log n · log log logn) time, point deletions in amortized O(log n · log logn) time, and various queries about the convex hull in optimal O(log n) worst-case time. The data structure requi...
متن کاملThe Parallel Complexity of Element Distinctness is Omega (sqrt(log n))
We consider the problem of element distinctness. Here $n$ synchronized processors, each given an integer input, must decide whether these integers are pairwise distinct, while communicating via an infinitely large shared memory. If simultaneous write access to a memory cell is forbidden, then a lower bound of $\Omega(log n)$ on the number of steps easily follows (from S. Cook, C. Dwork, and R. ...
متن کاملStUSPACE(log n) <= DSPACE(log²n / log log n)
We present a deterministic algorithm running in space O ? log 2 n= log logn solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(logn) time-bounded algorithm for this problem running on a parallel pointer machine.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1989
ISSN: 0022-0000
DOI: 10.1016/0022-0000(89)90035-4